Research on Model-Checking Based on Petri Nets

Model-Checking is a formal verified technique to check on whether a computing model, by searching the model state spaces, satisfies a given property described by an appropriate temporal logic. The main drawback of model checking, the explosion problem of state spaces, is mainly caused by concurrence and the interleaving semantics used to represent any sequences of possible actions. In this paper, the correlative model-checking theory and techniques based on Petri Nets are investigated in detailed, especially about the following problems, i.e. partial order reduction and partial order semantics techniques based on the state reachability graph, Buchi automata method, state cohesion method based on Petri Nets, and symbolic and parametriesed model-checking techniques based on system symmetries. Moreover, the key idea and our main researching work in the future are listed. With the gradual improvement of reducing techniques of state space and optimization of model-checking algorithm, model-checking technique has been successfully applied to verify communication protocols and complex hardware logic circuits, and also takes on a wide application prospect in other fields.